The computable dimension of ordered abelian groups
نویسندگان
چکیده
Let G be a computable ordered abelian group. We show that the computable dimension of G is either 1 or ω, that G is computably categorical if and only if it has finite rank, and that if G has only finitely many Archimedean classes, then G has a computable presentation which admits a computable basis.
منابع مشابه
Π1 classes and orderable groups
It is known that the spaces of orders on orderable computable fields can represent all Π1 classes up to Turing degree. We show that the spaces of orders on orderable computable abelian and nilpotent groups cannot represent Π1 classes in even a weak manner. Next, we consider presentations of ordered abelian groups, and we show that there is a computable ordered abelian group for which no computa...
متن کاملComputable Ordered Abelian Groups and Fields
We present transformations of linearly ordered sets into ordered abelian groups and ordered fields. We study effective properties of the transformations. In particular, we show that a linear order L has a ∆2 copy if and only if the corresponding ordered group (ordered field) has a computable copy. We apply these codings to study the effective categoricity of linear ordered groups and fields.
متن کاملIndependence in Computable Algebra
We give a sufficient condition for an algebraic structure to have a computable presentation with a computable basis and a computable presentation with no computable basis. We apply the condition to differentially closed, real closed, and difference closed fields with the relevant notions of independence. To cover these classes of structures we introduce a new technique of safe extensions that w...
متن کاملFirst non-abelian cohomology of topological groups II
In this paper we introduce a new definition of the first non-abelian cohomology of topological groups. We relate the cohomology of a normal subgroup $N$ of a topological group $G$ and the quotient $G/N$ to the cohomology of $G$. We get the inflation-restriction exact sequence. Also, we obtain a seven-term exact cohomology sequence up to dimension 2. We give an interpretation of the first non-a...
متن کاملComputable Structures: Presentations Matter
The computability properties of a relation R not included in the language of a computable structure A can vary from one computable presentation to another. We describe some classic results giving conditions onA orR that restrict the possible variations in the computable dimension of A (i.e. the number of isomorphic copies of A up to computable isomorphism) and the computational complexity ofR. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003